An Efficient Method for Evaluating Complex Polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Method for Evaluating Complex Polynomials

We propose an efficient hardware-oriented method for evaluating complex polynomials. The method is based on solving iteratively a system of linear equations. The solutions are obtained digit-by-digit on simple and highly regular hardware. The operations performed are defined over the reals. We describe a complex-to-real transform, a complex polynomial evaluation algorithm, the convergence condi...

متن کامل

Newton's method for complex polynomials

Newton's method is one of the most venerable and important algorithms in numerical analysis. It can also be used to produce some beautiful illustrations of chaos. It turns out that the structure of these images point the way to a recently published algorithm to find all the roots of a complex polynomial.

متن کامل

Newton’s method for complex polynomials

Newton’s method is a technique commonly used to approximate the roots of functions. For many functions, there are initial points, or seeds from which Newton’s method will fail to converge. For some complex valued polynomials, the set of such seeds has positive area and contains an attractive periodic orbit for the Newton iteration function. Despite the failure of these initial seeds to converge...

متن کامل

Horner’s Method for Evaluating and Deflating Polynomials

Horner’s method is a standard minimum arithmetic method for evaluating and deflating polynomials. It can also efficiently evaluate various order derivatives of a polynomial, therefore is often used as part of Newton’s method. This note tries to develop the various techniques called Horner’s method, nested evaluation, and synthetic division in a common framework using a recursive structure and d...

متن کامل

An Efficient Method for Model Reduction in Diffuse Optical Tomography

We present an efficient method for the reduction of model equations in the linearized diffuse optical tomography (DOT) problem. We first implement the maximum a posteriori (MAP) estimator and Tikhonov regularization, which are based on applying preconditioners to linear perturbation equations. For model reduction, the precondition is split into two parts: the principal components are consid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Signal Processing Systems

سال: 2008

ISSN: 1939-8018,1939-8115

DOI: 10.1007/s11265-008-0265-8